Deductive and inductive synthesis of equational programs
نویسندگان
چکیده
منابع مشابه
Deductive and Inductive Synthesis of Equational Programs |Draft|
An equational approach to the synthesis of functional and logic program is taken. Typically, the synthesis task involves nding equations which make the given speci cation an inductive theorem. To synthesize such programs, induction is necessary. We formulate e cient procedures for inductive proof as well as program synthesis using the framework of ordered rewriting. We also propose heuristics f...
متن کاملInductive Synthesis of Equational Programs
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the given domain rules. To synthesize such programs, induction is necessary. We propose heuristics for generalizing from a sequence of deductive consequences. These are combined with rewrite-based methods of inductive proof...
متن کاملDeductive and Inductive Methods for Program Synthesis
The paper discusses simple functional constraint networks and a value propagation method for program construction. Structural synthesis of programs is described as an example of deductive approach to program construction. An inductive method for program synthesis utilizing stochastic optimization algorithms is introduced to complement value propagation techniques.
متن کاملThe Deductive Synthesis of Imperative LISP Programs
A framework is described for the automatic synthesis of imperative programs, which may alter data structures and produce destructive side effects as part of their intended behavior. A program meeting a given specification is extracted from the proof of a theorem in a variant of situational logic, in which the states of a computation are explicit objects. As an example, an in-place reverse progr...
متن کاملLogic-Based Inductive Synthesis of Efficient Programs
Inductive programming approaches typically rely on an Occamist bias to select hypotheses with minimal textual complexity. This approach, however, fails to distinguish between the efficiencies of hypothesised programs, such as merge sort (O(n log n)) and bubble sort (O(n2)). We address this issue by introducing techniques to learn logic programs with minimal resource complexity. We describe an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1993
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(06)80002-7